Combinatorial optimization

Results: 1158



#Item
91Graph theory / Mathematics / NP-complete problems / Combinatorial optimization / Graph connectivity / Graph coloring / Graph / Matching / Triadic closure / Clique problem / Vertex cover / Clique

Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2014-09-25 06:28:22
92Mathematics / Computational complexity theory / Graph theory / Graphical models / Combinatorial optimization / Convex optimization / Operations research / Probability theory / Polynomial / Ellipsoid method / Markov random field / Bayesian network

Marginals-to-Models Reducibility Michael Kearns University of Pennsylvania

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2013-11-08 17:46:03
93Mathematics / Graph theory / Routing algorithms / Discrete mathematics / Edsger W. Dijkstra / Network theory / Combinatorial optimization / Search algorithms / Distance oracle / A* search algorithm / Shortest path problem / Link-state routing protocol

Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
94Theoretical computer science / Logic in computer science / Combinatorial optimization / Maximum satisfiability problem / Unit propagation / Constraint programming / Mathematics / Mathematical logic

Sequential Encodings from Max-CSP into Partial Max-SAT⋆ Josep Argelich1 , Alba Cabiscol2 , Inˆes Lynce3 , and Felip Many`a4 1 2

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55
95Mathematics / Operations research / Mathematical optimization / Geometry / Convex optimization / Linear programming / Combinatorial optimization / Ellipsoid method / Ellipsoid / Leonid Khachiyan / Fulkerson Prize / Ellipse

Steffen Rebennack Ellipsoid Method in Encyclopedia of Optimization, Second Edition, C.A. Floudas and P.M. Pardalos (Eds.), Springer, pp. 890–899, 2008

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
96Combinatorial optimization / Business / Real-time computing / Operations research / Technology / Planning / Scheduling algorithms / Professional studies / Rate-monotonic scheduling / Heuristic / Scheduling / Integer programming

Work-in-Progress Proceedings 27th Euromicro Conference on Real-Time Systems July 7 – 10, 2015 Lund, Sweden

Add to Reading List

Source URL: www.control.lth.se

Language: English - Date: 2015-07-09 03:36:07
97Graph theory / Computational complexity theory / Mathematics / Spanning tree / NP-complete problems / Approximation algorithms / Steiner tree problem / Complexity classes / APX / Combinatorial optimization / Minimum spanning tree / Cut

Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
98Mathematics / Combinatorial optimization / Routing algorithms / Matching / Search algorithms / Operations research

Optimal on-line colorings for minimizing the number of ADMs in optical networks⋆ Mordechai Shalom1,3 , Prudence W.H. Wong2 , and Shmuel Zaks1 ⋆⋆

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2009-02-24 10:13:31
99Graph theory / Mathematics / Submodular set function / Graph coloring / Spanning tree / Combinatorial optimization

Minimization of Symmetric Submodular Functions under Hereditary Constraints J.A. Soto (joint work with M. Goemans) DIM, Univ. de Chile

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:20
100Mathematics / Combinatorics / Combinatorial optimization / Matroid theory / Discrete mathematics / Matroid / Greedoid / Partition matroid / Matroid oracle

The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2008-11-17 17:17:16
UPDATE